Magic Sets with Full Sharing
نویسنده
چکیده
This paper discusses the relationship between tabulation and goal-oriented bottom-up evaluation of logic programs. Some diierences emerge when one tries to identify features of one evaluation method in the other. We show that to obtain the same eeect as tabulation in top-down, one has to perform a careful adornment in programs to be evaluated bottom-up. Furthermore we propose an eecient algorithm to perform subsumption checking over adorned magic facts. Soundness and completeness of the subsumption algorithm are proved. With the aim of substantiating the claimed improvements yield by this proposal several program evaluations are presented.
منابع مشابه
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the functional i.e., input/output behaviour of a program P , not enough if one needs P ’s internal behaviours i.e., from the input to some internal program points. We overcome this limitation with a technique used up to now...
متن کاملMagic-sets for localised analysis of Java bytecode
Static analyses based on denotational semantics can naturally model functional behaviours of the code in a compositional and completely context and flow sensitive way. But they only model the functional i.e., input/output behaviour of a program P , not enough if one needs P ’s internal behaviours i.e., from the input to some internal program points. This is, however, a frequent requirement for ...
متن کاملMagic Sets and Their Application to Data Integration
We propose a generalization of the well-known Magic Sets technique to Datalog¬ programs with (possibly unstratified) negation under stable model semantics. Our technique produces a new program whose evaluation is generally more efficient (due to a smaller instantiation), while preserving soundness under cautious reasoning. Importantly, if the original program is consistent, then full query-equi...
متن کاملSingle Phase Construction of Optimal DAG-structured QEPs
Traditionally, database management systems use tree-structured query evaluation plans. They are easy to implement but not expressive enough for some optimizations like eliminating common algebraic subexpressions or magic sets. These require directed acyclic graphs (DAGs), i.e. shared subplans. Existing approaches consider DAGs merely for special cases and not in full generality. We introduce a ...
متن کاملSignatura of Magic and Latin Integer Squares: Isentropic Clans and Indexing
The 2010 study of the Shannon entropy of order nine Sudoku and Latin square matrices by Newton and DeSalvo [Proc. Roy. Soc. A 2010] is extended to natural magic and Latin squares up to order nine. We demonstrate that decimal and integer measures of the Singular Value sets, here named SV clans, are a powerful way of comparing different integer squares. Several complete sets of magic and Latin sq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Program.
دوره 30 شماره
صفحات -
تاریخ انتشار 1997